- analog computation
- моделирование, вычисление на аналоговых [моделирующих] устройствах; pl аналоговые вычисления
English-Russian dictionary of computer science and programming. 2013.
analog computation
Смотреть что такое "analog computation" в других словарях:
Analog computer — An analog computer (spelt analogue in British English) is a form of computer that uses continuous physical phenomena such as electrical, [Universiteit van Amsterdam Computer Museum, (2007)] mechanical, or hydraulic quantities to model the problem … Wikipedia
Computation — is defined as any type of calculation.[1] Also defined as use of computer technology in Information processing.[2][3]Computation is a process following a well defined model understood and expressed in an algorithm, protocol, network topology, etc … Wikipedia
Analog ear — An analog ear or analog cochlea is a model of the ear or of the cochlea (in the inner ear) based on an electrical, electronic or mechanical analog. An analog ear is commonly described as an interconnection of electrical elements such as resistors … Wikipedia
Real computation — In computability theory, the theory of real computation deals with hypothetical computing machines using infinite precision real numbers. They are given this name because they operate on the set of real numbers. Within this theory, it is possible … Wikipedia
Models of neural computation — are attempts to elucidate, in an abstract and mathematical fashion, the core principles that underlie information processing in biological nervous systems, or functional components thereof. This article aims to provide an overview of the most… … Wikipedia
Interval-valued computation — is a special kind of theoretical models for computation. It is capable of working on “interval valued bytes”: special subsets of the unit interval. If such computers were realized, their computation power would be much greater than that of… … Wikipedia
computer — computerlike, adj. /keuhm pyooh teuhr/, n. 1. Also called processor. an electronic device designed to accept data, perform prescribed mathematical and logical operations at high speed, and display the results of these operations. Cf. analog… … Universalium
Computability theory — For the concept of computability, see Computability. Computability theory, also called recursion theory, is a branch of mathematical logic that originated in the 1930s with the study of computable functions and Turing degrees. The field has grown … Wikipedia
Hava Siegelmann — is a Computer Scientist at the University of Massachusetts who is Director of their Biologically Inspired Neural and Dynamical Systems Lab [ [http://binds.cs.umass.edu/index.html BINDS Lab] ] . In the early 1990s she proposed a new computational… … Wikipedia
Hypercomputation — refers to various hypothetical methods for the computation of non Turing computable functions (see also supertask). The term was first introduced in 1999 by Jack Copeland and Diane Proudfoot [Copeland and Proudfoot,… … Wikipedia
Super-recursive algorithm — In computer science and computability theory, super recursive algorithms are algorithms that are more powerful, that is, compute more, than Turing machines. The term was introduced by Mark Burgin, whose book Super recursive algorithms develops… … Wikipedia
